Decay rate for viscoelastic wave equation of variable coefficients with delay and dynamic boundary conditions

In this paper, we consider a viscoelastic wave equation of variable coefficients in the presence of past history with nonlinear damping and delay in the internal feedback and dynamic boundary conditions. Under suitable assumptions, we establish an explicit and general decay rate result without imposing restrictive assumption on the behavior of the relaxation function at infinity by Riemannian geometry method and Lyapunov functional method.     

The Determination of Protonation Constants of Some Amino Acids and Their Esters by Potentiometry in Different Media

In this study, stoichiometric protonation constants of L-tyrosine, L-cysteine, L-tryptophane, L-lysine, and L-histidine, and their methyl and ethyl esters in water and ethanol–water mixtures of 30, 50, and 70% ethanol (v/v), were determined potentiometrically using a combined pH electrode system calibrated as the concentration of hydrogen ion. Titrations were performed at 25^∘C and the ionic strength of the medium was maintained at 0.10 mol⋅L⁻¹ using sodium chloride. Protonation constants were calculated by using the BEST computer program. The effect of solvent composition on the protonation constants is discussed. The log₁₀ K₂ values of esters generally decreased with increasing ethanol content. However, the log₁₀ K₁ values of the esters of L-tyrosine, L-cysteine, and L-tryptophane were found to increase with increasing ethanol content in contrast those of L-lysine and L-histidine esters.     

完全非相干白光一维光生伏打暗空间孤子

使用白炽灯作光源在LiNbO₃∶Fe晶体内实验观察到一维白光光生伏打暗空间孤 子. 由奇数 和偶数初始条件分别产生了灰孤子和灰孤子对，它们所感应的波导能导向白光和相干光. 用 相干光清楚地探测到它们内部的多模结构. 该实验证明了白光光生伏打暗空间孤子的存在， 并指出了用完全非相干的白光暗孤子控制和导向相干光的可能性. 关键词： 光生伏打效应 自陷 完全非相干孤子 波导     

非线性互补问题的一种全局收敛的显式光滑Newton方法

本针对Po函数非线性互补问题，给出了一种显式光滑Newton方法，该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程，并在适当的假设条件下，证明了算法的全局收敛性。     

电路过渡过程的计算机辅助分析

电路过渡过程所列方程是微分方程，本文中采用的是方框图模型分析法，即将微分方程的复杂示解分解成最基本的加（减）、乘（除）、积分（微分）、增益等运算，采用VB设计用户界面产进行计算，并给出了一算例。     

The number of powers of 2 in a representation of large even integers II

It is proved that for any integerk≥ 54 000, there isN _k >0 depending onk only such that every even integer ≥N _k is a sum of two odd prime numbers andk powers of 2. Project partially supported by RGC Research Grant (No.HKU 7122/97P) and Post-Doctoral Fellowship of the University of Hong Kong.     

Surfaces of Constant Mean Curvature Bounded by Two Planar Curves

In this paper we study constant mean curvature compact surfaces with two Jordan curves in parallel planes as boundary and we investigate the point at which the surface inherits the symmetries of its boundary.     

A semi-analytical numerical method for time-dependent radiative transfer problems in slab geometry with coherent isotropic scattering

We describe a semi-analytical numerical method for coherent isotropic scattering time-dependent radiative transfer problems in slab geometry. This numerical method is based on a combination of two classes of numerical methods: the spectral methods and the Laplace transform (LTS_N) methods applied to the radiative transfer equation in the discrete ordinates (S_N) formulation. The basic idea is to use the essence of the spectral methods and expand the intensity of radiation in a truncated series of Laguerre polynomials in the time variable and then solve recursively the resulting set of “time-independent” S_N problems by using the LTS_N method. We show some numerical experiments for a typical model problem.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.